Quantum generalized Reed-Solomon codes: Unified framework for quantum MDS codes
نویسندگان
چکیده
We construct a new family of quantum MDS codes from classical generalized Reed-Solomon codes and derive the necessary and sufficient condition under which these quantum codes exist. We also give code bounds and show how to construct them analytically. We find that existing quantum MDS codes can be unified under these codes in the sense that when a quantum MDS code exists, then a quantum code of this type with the same parameters also exists. Thus as far as is known at present, they are the most important family of quantum MDS codes. PACS numbers: 03.67.Pp, 03.67.Hk, 03.67.Lx
منابع مشابه
New constructions of quantum MDS convolutional codes derived from generalized Reed-Solomon codes
Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. In this paper, we give two new constructions of quantum MDS convolutional codes derived from generalized Reed-Solomon codes and obtain eighteen new classes of quantum MDS convolutional codes. Most of them are new in the sense that the parameters of the codes are different from all th...
متن کاملQuantum Codes from Generalized Reed-Solomon Codes and Matrix-Product Codes
One of the central tasks in quantum error-correction is to construct quantum codes that have good parameters. In this paper, we construct three new classes of quantum MDS codes from classical Hermitian self-orthogonal generalized Reed-Solomon codes. We also present some classes of quantum codes from matrix-product codes. It turns out that many of our quantum codes are new in the sense that the ...
متن کاملTwo new classes of quantum MDS codes
Let p be a prime and let q be a power of p. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distanceseparable (MDS) codes with parameters [[tq, tq − 2d+ 2, d]]q for any 1 ≤ t ≤ q, 2 ≤ d ≤ ⌊ tq+q−1 q+1 ⌋+ 1, and [[t(q + 1) + 2, t(q + 1)− 2d+ 4, d]]q for any 1 ≤ t ≤ q− 1, 2 ≤ d ≤ t+2 with (p, t, d) 6= (...
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملQuantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller Codes
Convolutional stabilizer codes promise to make quantum communication more reliable with attractive online encoding and decoding algorithms. This paper introduces a new approach to convolutional stabilizer codes based on direct limit constructions. Two families of quantum convolutional codes are derived from generalized Reed-Solomon codes and from ReedMuller codes. A Singleton bound for pure con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0812.4514 شماره
صفحات -
تاریخ انتشار 2008